Search Results
Great Ideas in Theoretical Computer Science: Boolean Formulas and Circuits (Spring 2016)
Great Ideas in Theoretical Computer Science: Intro (Spring 2016) (audio broken; see description)
Great Ideas in Theoretical Computer Science: Time Complexity (Spring 2016)
Great Ideas in Theoretical Computer Science: Approximation Algorithms (Spring 2016)
Great Ideas in Theoretical Computer Science: Quantum Computing (Spring 2016)
Great Ideas in Theoretical Computer Science: Turing's Legacy (Spring 2015)
Analysis of Boolean functions: Applications || @ CMU || Lecture 8c of CS Theory Toolkit
Circuit Lower Bounds from Algorithm Design: An Overview I (Partial)
Analysis of Boolean Functions at CMU - Lecture 14: Probabilistically checkable proofs of proximity
Great Ideas in Theoretical Computer Science: Deductive Systems (Spring 2015)
Oracles, and the Polynomial Time Hierarchy vs. circuits: Graduate Complexity Lecture 8 at CMU
Analysis of Boolean Functions at CMU - Lecture 1: The Fourier expansion and basic formulas
